Braids and Permutations

نویسنده

  • Vladimir Lin
چکیده

E. Artin described all irreducible representations of the braid group B k to the symmetric group S(k). We strengthen some of his results and, moreover, exhibit a complete picture of homomorphisms ψ : B k → S(n) for n ≤ 2k. We show that the image Im ψ of ψ is cyclic whenever either (*) n < k = 4 or (* *) ψ is irreducible and 6 < k < n < 2k. For k > 6 there exist, up to conjugation, exactly 3 irreducible representations B k → S(2k) with non-cyclic images but they all are imprimitive. We use these results to prove that for n < k = 4 the image of any braid homomorphism ϕ : B k → B n is cyclic, whereas any endomorphism ϕ of B k with non-cyclic image preserves the pure braid group P B k. We prove also that for k > 4 the intersection P B k ∩ B ′ k of P B k with the commutator subgroup B ′ k = [B k , B k ] is a completely characteristic subgroup of B ′ k. Some results of this paper were obtained and the draft version [Lin96b] was written during my stay at the Max-Planck-Institut für Mathematik in Bonn in 1996. I am deeply grateful to MPI for hospitality.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Baxter Permutations, Maj-balances, and Positive Braids

In this paper we present two interesting properties of 321-avoiding Baxter permutations. The first one is a variant of refined major-balance identity for the 321avoiding Baxter permutations, respecting the number of fixed points and descents. The second one is a bijection between the 321-avoiding Baxter permutations with the entry 1 preceding the entry 2 and the positive braid words on four str...

متن کامل

Singular Braids and Partial Permutations

We introduce and study the partial singular braid monoid PSBn, a monoid that contains both the inverse braid monoid IBn and the singular braid monoid SBn. Our main results include a characterization of Green’s relations, a presentation in terms of generators and relations, and a proof that PSBn embeds in the semigroup algebra C[IBn].

متن کامل

Combinatorics of normal sequences of braids

Many natural counting problems arise in connection with the normal form of braids—and seem to have not been much considered so far. Here we solve some of them. One of the noteworthy points is that a number of different induction schemes appear. The key technical ingredient is an analysis of the normality condition in terms of permutations and their descents, in the vein of the Solomon algebra. ...

متن کامل

Still Another Approach to the Braid Ordering

We develop a new approach to the linear ordering of the braid group Bn, based on investigating its restriction to the set Div(∆n) of all divisors of ∆ d n in the monoid B ∞, i.e., to positive n-braids whose normal form has length at most d. In the general case, we compute several numerical parameters attached with the finite orders (Div(∆n), <). In the case of 3 strands, we moreover give a comp...

متن کامل

A Stream Cipher Based on Chaotic Permutations

In this paper we introduce a word-based stream cipher consisting of a chaotic part operating as a chaotic permutation and a linear part, both of which designed on a finite field. We will show that this system can operate in both synchronized and self-synchronized modes. More specifically, we show that in the self-synchronized mode the stream cipher has a receiver operating as an unknown input o...

متن کامل

Finite Type Invariants of W-knotted Objects I: W-knots and the Alexander Polynomial

This is the first in a series of papers studying w-knots, and more generally, wknotted objects (w-braids, w-tangles, etc.). These are classes of knotted objects which are wider but weaker than their “usual” counterparts. To get (say) w-knots from usual knots (or u-knots), one has to allow non-planar “virtual” knot diagrams, hence enlarging the the base set of knots. But then one imposes a new r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004